Efficiently Mining Frequent Itemsets on Massive Data
نویسندگان
چکیده
منابع مشابه
Efficiently Mining Maximal Frequent Itemsets
We present GenMax, a backtrack search based algorithm for mining maximal frequent itemsets. GenMax uses a number of optimizations to prune the search space. It uses a novel technique called progressive focusing to perform maximality checking, and diffset propagation to perform fast frequency computation. Systematic experimental comparison with previous work indicates that different methods have...
متن کاملEfficiently Mining Frequent Closed Itemsets by Eliminating Data Redundancies
Recently, data mining has been applied in business information and intelligence systems for discovering interesting patterns and knowledge to support decision making processes. One of the most basic and important tasks of data mining is the mining of frequent itemsets, which are sets of items frequently purchased by customers. Many methods have been proposed for this problem. However, mining th...
متن کاملITL-MINE: Mining Frequent Itemsets More Efficiently
The discovery of association rules is an important problem in data mining. It is a two-step process consisting of finding the frequent itemsets and generating association rules from them. Most of the research attention is focused on efficient methods of finding frequent itemsets because it is computationally the most expensive step. In this paper, we present a new data structure and a more effi...
متن کاملEfficiently Mining Frequent Itemsets in Transactional Databases
Discovering frequent itemsets is an essential task in association rules mining and it is considered to be computationally expensive. To find the frequent itemsets, the algorithm of frequent pattern growth (FP-growth) is one of the best algorithms for mining frequent patterns. However, many experimental results have shown that building conditional FP-trees during mining data using this FP-growth...
متن کاملEfficiently Using Prefix-trees in Mining Frequent Itemsets
Efficient algorithms for mining frequent itemsets are crucial for mining association rules. Methods for mining frequent itemsets and for iceberg data cube computation have been implemented using a prefix-tree structure, known as an FP-tree, for storing compressed information about frequent itemsets. Numerous experimental results have demonstrated that these algorithms perform extremely well. In...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2902602